International Colloquium on Automata

#	Item
71	PDF Document Add to Reading List Source URL: fpt.wdfiles.com Language: English - Date: 2012-09-17 06:30:58 Analysis of algorithms Parameterized complexity Kernelization Michael Fellows Time complexity Topological sorting International Colloquium on Automata Languages and Programming Directed acyclic graph NP-complete Theoretical computer science Applied mathematics Computational complexity theory